منابع مشابه
A Hybrid Meta-Heuristic Algorithm based on Imperialist Competition Algorithm
The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...
متن کاملA Hybrid Meta-Heuristic Algorithm based on Imperialist Competition Algorithm
The human has always been to up to the best in everything, And this perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables to find the best acceptable answer to the limitations in a problem, so that the objective function is a minimum or a maximum. Metaheuristic algorithms are one of inaccurate optimization methods that inspired by ...
متن کاملA Granular Reduction Algorithm Based on Covering Rough Sets
The granular reduction is to delete dispensable elements from a covering. It is an efficient method to reduce granular structures and get rid of the redundant information from information systems. In this paper, we develop an algorithm based on discernabilitymatrixes to compute all the granular reducts of covering rough sets. Moreover, a discernibility matrix is simplified to the minimal format...
متن کاملA cross entropy algorithm for continuous covering location problem
Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...
متن کاملMinimal K-Covering Set Algorithm based on Particle Swarm Optimizer
For random high density distribution in wireless sensor networks in this article have serious redundancy problems. In order to maximize the cost savings network resources for wireless sensor networks, extend the life network, this paper proposed a algorithm for the minimal k-covering set based on particle swarm optimizer. Firstly, the network monitoring area is divided into a number of grid poi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2012
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2012.01.461